An optimal algorithm for preemptive on-line scheduling
نویسندگان
چکیده
منابع مشابه
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
We investigate the problem of on-line scheduling jobs on m identical parallel machines where preemption is allowed. The goal is to minimize the maximum flow time among all jobs, where the flow time of a job is its completion time minus its release time. We derive an on-line algorithm with competitive ratio 2 − 1/m. Moreover, when the algorithm must schedule jobs one by one in the order they are...
متن کاملAn Asymptotically Optimal On-Line Algorithm for Parallel Machine Scheduling
| Jobs arriving over time must be nonpreemptively processed on one of m parallel machines, each of which running at its own speed, so as to minimize a weighted sum of the job completion times. In this on-line environment, the processing requirement and weight of a job are not known before the job arrives. The Weighted Shortest Processing Requirement (WSPR) on-line heuristic is a simple extensio...
متن کاملOptimal Online Preemptive Scheduling
In this lecture we’ll study online preemptive scheduling on m machines of arbitrary speeds. We’ll first review the problem and it’s associated literature, then give an optimal deterministic algorithm known as ”RatioStretch”. RatioStretch uses the optimal competitive ratio R > 1 as an input, and achieves R whenever such an R is obtainable. The exact optimal R maybe computed via a linear program,...
متن کاملAn Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
This paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. Assume that we have n identical processors, and a number of tasks to perform. Each task T i requires an amount of time pi to complete, 0 < CL. 1 i k, so that k is an upper bound on task length. Tasks are indivisible, so that a processor on...
متن کاملOptimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one aims at scheduling the jobs to the machines, allowing preemptions but forbidding parallelization, so that a given target function of the loads on each machine is minimized. This problem was studied in the past in the case...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1995
ISSN: 0167-6377
DOI: 10.1016/0167-6377(95)00039-9